Delaunay simplexes in physics
نویسنده
چکیده
Delaunay simplexes are very helpful instrument for analysis of computer models of atomic, molecular and granular systems. This paper illustrates their application to the current physical problems. The first one is the structure of non-crystalline packing of spheres. Recently it got the advance thanks to application of the Delaunay simplexes with quantitative measures of simplex shape. The second important problem is recognition and analysis of intermolecular voids. Delaunay simplex represents “the simplicial cavities”, and any complex void is a cluster of such cavities..
منابع مشابه
Shapes of Delaunay Simplexes and Structural Analysis of Hard Sphere Packings
In this chapter we apply a computational geometry technique to investigate the structure of packings of hard spheres. The hard sphere model is the base for understanding the structure of many physical matters: liquids, solids, colloids and granular materials. The structure analysis is based on the concept of the Voronoi Diagram (Voronoi-Delaunay tessellation), which is well known in mathematics...
متن کاملAn Infinite Series of Perfect Quadratic Forms and Big Delaunay Simplexes in Z
Georges Voronoi (1908-09) introduced two important reduction methods for positive quadratic forms: the reduction with perfect forms, and the reduction with L-type domains. A form is perfect if it can be reconstructed from all representations of its arithmetic minimum. Two forms have the same L-type if Delaunay tilings of their lattices are affinely equivalent. Delaunay (1937-38) asked about pos...
متن کاملScalable Macromodeling of Microwave Systems Responses using Sequential Sampling with Path-Simplexes
Introduction: Efficient design of electromagnetic (EM) systems often requires expensive simulations using EM solvers which normally provide high accuracy at a significant cost in terms of memory storage and computing time. Alternatively, scalable macromodels can be used, which approximate the complex behavior of EM systems, characterized by frequency and additional design parameters, such as ge...
متن کاملDelaunay stability via perturbations
We present an algorithm that takes as input a finite point set in R, and performs a perturbation that guarantees that the Delaunay triangulation of the resulting perturbed point set has quantifiable stability with respect to the metric and the point positions. There is also a guarantee on the quality of the simplices: they cannot be too flat. The algorithm provides an alternative tool to the we...
متن کاملThe Stability of Delaunay Triangulations
We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions. We quantify the magnitude of the perturbations under which the Delaunay triangulation r...
متن کامل